Predefined-time consensus using a time base generator (TBG)
نویسندگان
چکیده
منابع مشابه
Bio-mimetic trajectory generation using a neural time-base generator
This paper presents a neural time-base generator TBG that can generate a family of neural control signals with a controllable finite duration and bell-shaped velocity profile. Then, a bio-mimetic trajectory generation method using the neural TBG model is explained. Using the proposed model, the generation ability of human-like trajectories is examined through comparisons between computer simula...
متن کاملA Time-predefined Approach to Course Timetabling
A common weakness of local search metaheuristics, such as Simulated Annealing, in solving combinatorial optimisation problems, is the necessity of setting a certain number of parameters. This tends to make significantly increase the total amount of time required to solve the problem and often requires a high level of experience from the user. This paper is motivated by the goal of overcoming th...
متن کاملPredefined pattern detection in large time series
Predefined pattern detection from time series is an interesting and challenging task. In order to reduce its computational cost and increase effectiveness, a number of time series representation methods and similarity measures have been proposed. Most of the existing methods focus on full sequence matching, that is, sequences with clearly defined beginnings and endings, where all data points co...
متن کاملMultiwavelength pulse generator using time-lens compression.
We demonstrate a novel method of generating a multiwavelength pulse train by use of time-lens compression. In addition to pulse compression, this time lens simultaneously displaces the pulses according to their center wavelengths, resulting in a temporally evenly spaced multiwavelength pulse train. We further demonstrate a new aberration-correction technique based on the temporal analog of a sp...
متن کاملA time-predefined local search approach to exam timetabling problems
In recent years the computational power of computers has increased dramatically. This in turn has allowed search algorithms to execute more iterations in a given amount of real time. Does this necessarily always lead to an improvement in the quality of final solutions? This paper is devoted to the investigation of that question. We present two variants of local search algorithms where the searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2018
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2018.07.286